Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs
نویسندگان
چکیده
منابع مشابه
Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs
The main question discussed in this paper is how well a finite metric space of size n can be embedded into a graph with certain topological restrictions. The existing constructions of graph spanners imply that any n-point metric space can be represented by a (weighted) graph with n vertices and n1+O(1/r) edges, with distances distorted by at most r . We show that this tradeoff between the numbe...
متن کاملTowards Lower Bounds on Embedding Distortion in Information Hiding
We propose two efficient information hiding algorithms in the least significant bits of JPEG coefficients of images. Our algorithms embed information by modifying JPEG coefficients in such a way that the introduced distortion is minimized. We derive the expected value of the additional error due to distortion as a function of the message length and the probability distribution of the JPEG quant...
متن کاملEmbedding Finite Metric Spaces in Low Dimension
This paper presents novel techniques that allow the solution to several open problems regarding embedding of finite metric spaces into Lp. We focus on proving near optimal bounds on the dimension with which arbitrary metric spaces embed into Lp. The dimension of the embedding is of very high importance in particular in applications and much effort has been invested in analyzing it. However, no ...
متن کاملOPTIMAL LOWER BOUNDS ON THE MAXIMAL p-NEGATIVE TYPE OF FINITE METRIC SPACES
Abstract. Determining meaningful lower bounds on the supremal strict pnegative type of classes of finite metric spaces can be a difficult nonlinear problem. In this paper we use an elementary approach to obtain the following result: Given a finite metric space (X, d) there is a constant ζ > 0, dependent only on n = |X| and the scaled diameter D = (diam X)/min{d(x, y)|x 6= y} of X (which we may ...
متن کاملOn Embedding of Finite Metric Spaces into Hilbert Space
Metric embedding plays an important role in a vast range of application areas such as computer vision, computational biology, machine learning, networking, statistics, and mathematical psychology, to name a few. The main criteria for the quality of an embedding is its average distortion over all pairs. A celebrated theorem of Bourgain states that every finite metric space on n points embeds in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1998
ISSN: 0179-5376
DOI: 10.1007/pl00009336